Composite Pattern Discovery for PCR Application
نویسندگان
چکیده
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The problem was introduced in [1] and is motivated by the optimization of multiplexed nested PCR. We study algorithms for the following two cases; the special case when the two patterns in the pair are required to have the same length, and the more general case when the patterns can have different lengths. For the first case we present an O(αn log log n) time and O(n) space algorithm, and for the general case we give an O(αn log n) time and O(n) space algorithm. The algorithms work for any alphabet size and use asymptotically less space than the algorithms presented in [1]. For alphabets of constant size we also give an O(n √ n log n) time algorithm for the general case. We demonstrate that the algorithms perform well in practice and present our findings for the human genome. In addition, we study an extended version of the problem where patterns in the pair occur at certain positions at a distance at most α, but do not occur α-close anywhere else, in the input sequence.
منابع مشابه
Withdrawing of Article ''Application of Cell-Based Assay Systems for the Early Screening of Human Drug Hepatotoxicity in the Discovery Phase of Drug Development''
متن کامل
Withdrawing of Article ''Application of Cell-Based Assay Systems for the Early Screening of Human Drug Hepatotoxicity in the Discovery Phase of Drug Development''
متن کامل
Dynamic Service Composition: a Discovery-Based Approach
Service-Orientated Computing (SOC) has become a main trend in software engineering that promotes the construction of applications based on the notion of services. SOC has recently attracted the researchers’ attention and has been adopted industry-wide. However, service composition that enables one to aggregate existing services into a new composite service is still a highly complex and critical...
متن کاملSparse Directed Acyclic Word Graphs
The suffix tree of string w is a text indexing structure that represents all suffixes ofw. A sparse suffix tree ofw represents only a subset of suffixes of w. An application to sparse suffix trees is composite pattern discovery from biological sequences. In this paper, we introduce a new data structure named sparse directed acyclic word graphs (SDAWGs), which are a sparse text indexing version ...
متن کاملA New Discovery about Inflow Control Devices in Controlling Water and Increasing Oil Recovery
Inflow control devices (ICD), which prevent water breakthrough by controlling the inflow profile of a well, have been used successfully in many oilfields. This paper will introduce a new discovery and an unsuccessful example. Moreover, this paper investigates meticulously and thoroughly to find the application conditions of the new discovery. Based on permeability rush coefficient and permeabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005